#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e5;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
priority_queue<LL, vector<LL>, greater<LL> >que;
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL n;cin>>n;
  for(LL i=1;i<=n;i++){
    LL x;cin>>x;que.push(x);
  }
  if(n%2==0) que.push(0);
  LL ans=0;
  while(que.size()>1){
    LL t1=que.top();que.pop();
    ans+=t1;
    LL t2=que.top();que.pop();
    ans+=t2;
    LL t3=que.top();que.pop();
    ans+=t3;
    que.push(t1+t2+t3);
  }
  cout<<ans<<"\n";
return 0;
}
